Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
نویسندگان
چکیده
We offer a transition system representing a high-level but detailed architecture for SMT solvers that combine a propositional SAT engine with solvers for multiple disjoint theories. The system captures succintly and accurately all the major aspects of the solver’s global operation: boolean search with across-the-board backjumping, communication of theory-specific facts and equalities between shared variables, and cooperative conflict analysis. Provably correct and prudently underspecified, our system is a readily usable ground for high-quality implementations of comprehensive SMT solvers.
منابع مشابه
Splitting on Demand in SAT Modulo Theories
Lazy algorithms for Satisfiability Modulo Theories (SMT) combine a generic DPLL-based SAT engine with a theory solver for the given theory T that can decide the T -consistency of conjunctions of ground literals. For many theories of interest, theory solvers need to reason by performing internal case splits. Here we argue that it is more convenient to delegate these case splits to the DPLL engin...
متن کاملSMT Beyond DPLL(T): A New Approach to Theory Solvers and Theory Combination
Satisifiability modulo theories (smt) is the problem of deciding whether a given logical formula can be satisifed with respect to a combination of background theories. The past few decades have seen many significant developments in the field, including fast Boolean satisfiability solvers (sat), efficient decision procedures for a growing number of expressive theories, and frameworks for modular...
متن کاملBarcelogic SAT Solver: System description
Our original aim for developing it was the need of a DPLL-based engine for our DPLL(T ) approach to Satisfiability Modulo Theories (SMT): deciding the satisfiability of ground first-order formulas with respect to background theories such as equality, linear integer or real arithmetic, arrays, etc. A DPLL(T ) system consists of a general DPLL(X) engine, very similar in nature to a SAT solver, wh...
متن کاملOn SAT Modulo Theories and Optimization Problems
Solvers for SAT Modulo Theories (SMT) can nowadays handle large industrial (e.g., formal hardware and software verification) problems over theories such as the integers, arrays, or equality. Here we show that SMT approaches can also efficiently solve problems that, at first sight, do not have a typical SMT flavor. In particular, here we deal with SAT and SMT problems where models M are sought s...
متن کاملFrom KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
In the last two decades we have witnessed an impressive advance in the efficiency of propositional satisfiability techniques (SAT), which has brought large and previously-intractable problems at the reach of state-of-the-art SAT solvers. Most of this success is motivated by the impressive level of efficiency reached by current implementations of the DPLL procedure. Plain propositional logic, ho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007